منابع مشابه
Ellipsoid Method
In this article we give an overview of the Ellipsoid Method. We start with a historic introduction and provide a basic algorithm in Section 2. Techniques to avoid two important assumptions required by this algorithm are considered in Section 2.2. After the discussion of some implementation aspects, we are able to show the polynomial running time of the Ellipsoid Method. The second section is cl...
متن کاملCharacterization theorems for PDL and FO(TC)
Our main contributions can be divided in three parts: (1) Fixpoint extensions of first-order logic: we give a precise syntactic and semantic characterization of the relationship between FO(TC) and FO(LFP). (2) Automata and expressiveness on trees: we introduce a new class of parity automata which, on trees, captures the expressive power of FO(TC) and WCL (weak chain logic). The latter logic is ...
متن کاملA Short Proof of Toruńczyk’s Characterization Theorems
We present short proofs of Toruńczyk’s well-known characterization theorems of the Hilbert cube and Hilbert space, respectively.
متن کاملUniqueness and characterization theorems for generalized entropies
The requirement that an entropy function be composable is key: it means that the entropy of a compound system can be calculated in terms of the entropy of its independent components. We prove that, under mild regularity assumptions, the only composable generalized entropy in trace form is the Tsallis one-parameter family (which contains Boltzmann–Gibbs as a particular case). This result leads t...
متن کاملThe Ellipsoid Algorithm
The Ellipsoid algorithm was developed by (formerly) Soviet mathematicians (Shor (1970), Yudin and Nemirovskii (1975)). Khachian (1979) proved that it provides a polynomial time algorithm for linear programming. The average behavior of the Ellipsoid algorithm is too slow, making it not competitive with the simplex algorithm. However, the theoretical implications of the algorithm are very importa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: advg
سال: 2013
ISSN: 1615-7168,1615-715X
DOI: 10.1515/advgeom-2012-0031